Optimizing Task Execution: The Impact of Dynamic Time Quantum and Priorities on Round Robin Scheduling

Task scheduling algorithms are crucial for optimizing the utilization of computing resources. This work proposes a unique approach improving task execution in real-time systems using an enhanced Round Robin algorithm variant incorporating dynamic time quantum and priority. The proposed adjusts slice allocated to each based on priority, resulting more efficient resource utilization. We also prioritize higher-priority tasks execute them as soon they arrive ready queue, ensuring timely completion critical tasks. evaluate performance our set real-world compare it with traditional scheduling. results show that significantly improves compared conventional Our offers promising solution systems. combination priorities adds element existing literature this field.